Partial orders on words, minimal elements of regular languages, and state complexity
نویسندگان
چکیده
منابع مشابه
Regular languages of partial words
We initiate a study of languages of partial words related to regular languages of full words. First, we investigate the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words by a finite set of letters. Results regarding the structure, uniqueness and succinctness of such ...
متن کاملConnecting Partial Words and Regular Languages
We initiate a study of languages of partial words related to regular languages of full words. First, we study the possibility of expressing a regular language of full words as the image of a partial-wordslanguage through a substitution that only replaces the hole symbols of the partial words with a finite set of letters. Results regarding the structure, uniqueness and succinctness of such a rep...
متن کاملState Complexity of Regular Languages
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.
متن کاملReversal of regular languages and state complexity
We study the state complexity of languages that can be obtained as reversals of regular languages represented by deterministic finite automata. We show that the state complexity of the reversal of a regular language with state complexity n is between logn and 2. We first prove that the upper bound is tight in the ternary case. Then we present binary languages reaching this upper bound on the re...
متن کاملState Complexity of Prefix-Free Regular Languages
We investigate the state complexities of basic operations for prefix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefix-free if and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90160-u